Theorem Proving Support for View Consistency Checking
نویسندگان
چکیده
منابع مشابه
Theorem Proving Support for View Consistency Checking
A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented. The views, described in the BON modelling language, capture the static architecture of systems via contract-annotated class diagrams, and the dynamic view provided by collaboration diagrams. The constraints are specified as an extension of the BON metamodel, an...
متن کاملProving sequential consistency by model checking
Sequential consistency is a multiprocessor memory model of both practical and theoretical importance. Unfortunately, the general problem of verifying that a finitestate protocol implements sequential consistency is undecidable, and in practice, validating that a real-world, finitestate protocol implements sequential consistency is very time-consuming and costly. In this work, we show that for m...
متن کاملProof-Checking, Theorem-Proving, and Program Verification
This article consists of three parts: a tutorial introduction to a computer program that proves theorems by induction; a brief description of recent applications of that theorem-prover; and a discussion of several nontechnical aspects of the problem of building automatic theorem-provers. The theorem-prover described has proved theorems such as the uniqueness of prime factorizations, Fermat’s th...
متن کاملLinking Theorem Proving and Model - Checking
We present an approach to veriication that combines the strengths of model-checking and theorem proving. We use theorem proving to show a bisimula-tion up to stuttering on a|potentially innnite-state|system. Our characterization of stuttering bisimulation allows us to do such proofs by reasoning only about single steps of the system. We present an on-they method that extracts the reachable quot...
متن کاملCombinations of Model Checking and Theorem Proving
The two main approaches to the formal verification of reactive systems are based, respectively, on model checking (algorithmic verification) and theorem proving (deductive verification). These two approaches have complementary strengths and weaknesses, and their combination promises to enhance the capabilities of each. This paper surveys a number of methods for doing so. As is often the case, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: L'objet
سال: 2003
ISSN: 1262-1137
DOI: 10.3166/objet.9.4.115-134